(−1)–enumeration of Plane Partitions with Complementation Symmetry

نویسنده

  • THERESIA EISENKÖLBL
چکیده

We compute the weighted enumeration of plane partitions contained in a given box with complementation symmetry where adding one half of an orbit of cubes and removing the other half of the orbit changes the weight by −1 as proposed by Kuperberg in [7, pp.25/26]. We use nonintersecting lattice path families to accomplish this for transpose–complementary, cyclically symmetric transpose–complementary and totally symmetric self–complementary plane partitions. For symmetric transpose– complementary and self–complementary plane partitions we get partial results and for cyclically symmetric self–complementary plane partitions we have a conjecture.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetries of plane partitions

We introduce a new symmetry operation, called complementation, on plane partitions whose three-dimensional diagram is contained in a given box. This operation was suggested by work of Mills, Robbins, and Rumsey. There then arise a total of ten inequivalent problems concerned with the enumeration of plane partitions with a given symmetry. Four of these ten problems had been previously considered...

متن کامل

Counting Orbits Under Kreweras Complementation

The Kreweras complementation map is an anti-isomorphism on the lattice of noncrossing partitions. We consider an analogous operation for plane trees motivated by the molecular biology problem of RNA folding. In this context, we explicitly count the orbits of Kreweras’ map according to their length as the number of appropriate symmetry classes of trees in the plane. These new enumeration results...

متن کامل

Plane Partitions Ii: 5 1 2 Symmetry Classes

We present new, simple proofs for the enumeration of ve of the ten symmetry classes of plane partitions contained in a given box. Four of them are derived from a simple determinant evaluation, using combinatorial arguments. The previous proofs of these four cases were quite complicated. For one more symmetry class we give an elementary proof in the case when two of the sides of the box are equa...

متن کامل

m at h . C O ] 4 A ug 1 99 8 PLANE PARTITIONS II : 5 1 2 SYMMETRY CLASSES

We present new, simple proofs for the enumeration of five of the ten symmetry classes of plane partitions contained in a given box. Four of them are derived from a simple determinant evaluation, using combinatorial arguments. The previous proofs of these four cases were quite complicated. For one more symmetry class we give an elementary proof in the case when two of the sides of the box are eq...

متن کامل

Some Hidden Relations Involving the Ten Symmetry Classes of Plane Partitions

Let B be a partially ordered product of three finite chains. For any group G of automorphisms of B, let N,(B, q) denote the rank generating function for G-invariant order ideals of B. If we regard B as a rectangular prism, N,(B, q) can be viewed as a generating function for plane partitions that fit inside B. Similarly, define Nh(B, 4) to be the rank generating function for order ideals of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000